Перевод: с английского на русский

с русского на английский

strict subset

См. также в других словарях:

  • Subset — In mathematics, especially in set theory, a set A is a subset of a set B if A is contained inside B . Notice that A and B may coincide. The relationship of one set being a subset of another is called inclusion.DefinitionsIf A and B are sets and… …   Wikipedia

  • Strict — In mathematical writing, the adjective strict is used to modify technical terms which have multiple meanings. It indicates that the exclusive meaning of the term is to be understood. (More formally, one could say that this is the meaning which… …   Wikipedia

  • Strict differentiability — In mathematics, strict differentiability is a modification of the usual notion of differentiability of functions that is particularly suited to p adic analysis. In short, the definition is made more restrictive by allowing both points used in the …   Wikipedia

  • co-NP — Unsolved problems in computer science Is NP = co NP ? In computational complexity theory, co NP is a complexity class. A problem is a member of co NP if and only if its complement is in the complexi …   Wikipedia

  • Co-NP — In computational complexity theory, co NP is a complexity class. A problem mathcal{X} is a member of co NP if and only if its complement overline{mathcal{X is in complexity class NP. In simple terms, co NP is the class of problems for which… …   Wikipedia

  • MathML — For help writing formulae in Wikipedia, please see Help:Formula. (MathML) Mathematical Markup Language Developed by World Wide Web Consortium Type of format Markup language Extended from XML Standard(s) …   Wikipedia

  • Riemann surface — For the Riemann surface of a subring of a field, see Zariski–Riemann space. Riemann surface for the function ƒ(z) = √z. The two horizontal axes represent the real and imaginary parts of z, while the vertical axis represents the real… …   Wikipedia

  • P (complexity) — In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems which can be solved by a deterministic Turing machine using a polynomial amount of… …   Wikipedia

  • Java Platform, Micro Edition — Java editions Java Card Micro Edition (ME) Standard Edition (SE) Enterprise Edition (EE) …   Wikipedia

  • Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example …   Wikipedia

  • Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»